Lattice Attacks on Digital Signature Schemes
نویسندگان
چکیده
We describe a lattice attack on the Digital Signature Algorithm (DSA) when used to sign many messages, mi, under the assumption that a proportion of the bits of each of the associated ephemeral keys, yi, can be recovered by alternative techniques.
منابع مشابه
CRYSTALS - Dilithium: Digital Signatures from Module Lattices
This paper presents Dilithium, a lattice-based signature scheme that is part of the CRYSTALS (Cryptographic Suite for Algebraic Lattices) package that will be submitted to the NIST call for postquantum standards. The scheme is designed to be simple to securely implement against side-channel attacks and to have comparable efficiency to the currently best lattice-based signature schemes. Our impl...
متن کاملAdapting Lyubashevsky's Signature Schemes to the Ring Signature Setting
Basing signature schemes on strong lattice problems has been a long standing open issue. Today, two families of lattice-based signature schemes are known: the ones based on the hash-andsign construction of Gentry et al.; and Lyubashevsky’s schemes, which are based on the Fiat-Shamir framework. In this paper we show for the first time how to adapt the schemes of Lyubashevsky to the ring signatur...
متن کاملLattice-Based Revocable Certificateless Signature
Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by...
متن کاملLoop abort Faults on Lattice-Based Fiat-Shamir & Hash'n Sign signatures
As the advent of general-purpose quantum computers appears to be drawing closer, agencies and advisory bodies have started recommending that we prepare the transition away from factoring and discrete logarithm-based cryptography, and towards postquantum secure constructions, such as lattice-based schemes. Almost all primitives of classical cryptography (and more!) can be realized with lattices,...
متن کاملHOW SAGE HELPS TO IMPLEMENT GOPPA CODES AND THE McELIECE PUBLIC KEY CRYPTO SYSTEM
Common cryptographic methods, especially Public Key Crypto Systems, PKCS based on difficulty to factor large integers or to compute the discrete logarithm, commonly deployed today will not resist attacks using quantum computers once these are operational. However, there are alternatives like hash based digital signature schemes, lattice based cryptography, or multivariatequadratic-equations pub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 23 شماره
صفحات -
تاریخ انتشار 2001